Proper Hamiltonian Paths in Edge-Coloured Multigraphs

نویسندگان

  • Raquel Águeda
  • Valentin Borozan
  • Marina Groshaus
  • Yannis Manoussakis
  • Gervais Mendy
  • Leandro Montero
چکیده

Given a c-edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In this work we establish sufficient conditions for an edge-coloured multigraph to guarantee the existence of a proper Hamiltonian path, involving various parameters as the number of edges, the number of colours, the rainbow degree and the connectivity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Alternating cycles and paths in edge-coloured multigraphs: A survey

A path or cycle in an edge-coloured multigraph is called alternating if its successive edges differ in colour. We survey results of both theoretical and algorithmic character concerning alternating cycles and paths in edge-coloured multigraphs. We also show useful connections between the theory of paths and cycles in bipartite digraphs and the theory of alternating paths and cycles in edge-colo...

متن کامل

Graphs and colors : edge-colored graphs, edge-colorings and proper connections. (Graphes et couleurs : graphes arêtes-coloriés, coloration d'arêtes et connexité propre)

In this thesis, we study different problems in edge-colored graphs and edge-colored multigraphs, such as proper connection, strong edge colorings, and proper hamiltonian paths and cycles. Finally, we improve the known O(n) algorithm to decide the behavior of a graph under the biclique operator, by studying bicliques in graphs without false-twin vertices. In particular, • We first study the k-pr...

متن کامل

Proper Hamiltonian Paths in Edge-Colored Multigraphs

A c-edge-colored multigraph has each edge colored with one of the c available colors and no two parallel edges have the same color. A proper hamiltonian path is a path containing all the vertices of the multigraph such that no two adjacent edges have the same color. In this work we establish sufficient conditions for a multigraph to have a proper hamiltonian path, depending on several parameter...

متن کامل

Alternating cycles and trails in 2-edge-coloured complete multigraphs

We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M be a 2-edge-coloured complete multigraph. M. Bankfalvi and Zs. Bankfalvi [2] obtained a necessary and sufficient condition for G to have a Hamiltonian alternating cycle. Generalizing this theorem, P. Das and S.B. Rao [7]...

متن کامل

Properly Coloured Cycles and Paths: Results and Open Problems

In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of transformations of an edge-coloured multigraph G into an ordinary graph that allow us to check the existence of PC cycles and PC (s, t)-paths in G and, if they exist, ...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2017